Hypersequent and Labelled Calculi for Intermediate Logics
Identifieur interne : 001574 ( Main/Exploration ); précédent : 001573; suivant : 001575Hypersequent and Labelled Calculi for Intermediate Logics
Auteurs : Agata Ciabattoni [Autriche] ; Paolo Maffezioli [Pays-Bas] ; Lara Spendier [Autriche]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Hypersequent and labelled calculi are often viewed as antagonist formalisms to define cut-free calculi for non-classical logics. We focus on the class of intermediate logics to investigate the methods of turning Hilbert axioms into hypersequent rules and frame conditions into labelled rules. We show that these methods are closely related and we extend them to capture larger classes of intermediate logics.
Url:
DOI: 10.1007/978-3-642-40537-2_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003102
- to stream Istex, to step Curation: 003063
- to stream Istex, to step Checkpoint: 000200
- to stream Main, to step Merge: 001586
- to stream Main, to step Curation: 001574
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Hypersequent and Labelled Calculi for Intermediate Logics</title><author><name sortKey="Ciabattoni, Agata" sort="Ciabattoni, Agata" uniqKey="Ciabattoni A" first="Agata" last="Ciabattoni">Agata Ciabattoni</name></author><author><name sortKey="Maffezioli, Paolo" sort="Maffezioli, Paolo" uniqKey="Maffezioli P" first="Paolo" last="Maffezioli">Paolo Maffezioli</name></author><author><name sortKey="Spendier, Lara" sort="Spendier, Lara" uniqKey="Spendier L" first="Lara" last="Spendier">Lara Spendier</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CE817F03FCEFF92CAC40FB76A2FA32AD57C2A896</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_9</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-F7600QD3-8/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003102</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003102</idno><idno type="wicri:Area/Istex/Curation">003063</idno><idno type="wicri:Area/Istex/Checkpoint">000200</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000200</idno><idno type="wicri:doubleKey">0302-9743:2013:Ciabattoni A:hypersequent:and:labelled</idno><idno type="wicri:Area/Main/Merge">001586</idno><idno type="wicri:Area/Main/Curation">001574</idno><idno type="wicri:Area/Main/Exploration">001574</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Hypersequent and Labelled Calculi for Intermediate Logics</title><author><name sortKey="Ciabattoni, Agata" sort="Ciabattoni, Agata" uniqKey="Ciabattoni A" first="Agata" last="Ciabattoni">Agata Ciabattoni</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Vienna University of Technology</wicri:regionArea></affiliation></author><author><name sortKey="Maffezioli, Paolo" sort="Maffezioli, Paolo" uniqKey="Maffezioli P" first="Paolo" last="Maffezioli">Paolo Maffezioli</name><affiliation wicri:level="1"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>University of Groningen</wicri:regionArea></affiliation></author><author><name sortKey="Spendier, Lara" sort="Spendier, Lara" uniqKey="Spendier L" first="Lara" last="Spendier">Lara Spendier</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Vienna University of Technology</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Hypersequent and labelled calculi are often viewed as antagonist formalisms to define cut-free calculi for non-classical logics. We focus on the class of intermediate logics to investigate the methods of turning Hilbert axioms into hypersequent rules and frame conditions into labelled rules. We show that these methods are closely related and we extend them to capture larger classes of intermediate logics.</div></front></TEI><affiliations><list><country><li>Autriche</li><li>Pays-Bas</li></country></list><tree><country name="Autriche"><noRegion><name sortKey="Ciabattoni, Agata" sort="Ciabattoni, Agata" uniqKey="Ciabattoni A" first="Agata" last="Ciabattoni">Agata Ciabattoni</name></noRegion><name sortKey="Spendier, Lara" sort="Spendier, Lara" uniqKey="Spendier L" first="Lara" last="Spendier">Lara Spendier</name></country><country name="Pays-Bas"><noRegion><name sortKey="Maffezioli, Paolo" sort="Maffezioli, Paolo" uniqKey="Maffezioli P" first="Paolo" last="Maffezioli">Paolo Maffezioli</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001574 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001574 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:CE817F03FCEFF92CAC40FB76A2FA32AD57C2A896
|texte= Hypersequent and Labelled Calculi for Intermediate Logics
}}
| This area was generated with Dilib version V0.6.33. |  |